Performance guarantees for Schatten-p quasi-norm minimization in recovery of low-rank matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Guarantees for Schatten-$p$ Quasi-Norm Minimization in Recovery of Low-Rank Matrices

We address some theoretical guarantees for Schatten-p quasi-norm minimization (p ∈ (0, 1]) in recovering low-rank matrices from compressed linear measurements. Firstly, using null space properties of the measuring operator, we provide a sufficient condition for exact recovery of low-rank matrices. This condition guarantees unique recovery of matrices of ranks equal or larger than what is guaran...

متن کامل

Low-Rank Matrix Recovery via Efficient Schatten p-Norm Minimization

As an emerging machine learning and information retrieval technique, the matrix completion has been successfully applied to solve many scientific applications, such as collaborative prediction in information retrieval, video completion in computer vision, etc. The matrix completion is to recover a low-rank matrix with a fraction of its entries arbitrarily corrupted. Instead of solving the popul...

متن کامل

Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization

The Schatten quasi-norm was introduced tobridge the gap between the trace norm andrank function. However, existing algorithmsare too slow or even impractical for large-scale problems. Motivated by the equivalencerelation between the trace norm and its bilin-ear spectral penalty, we define two tractableSchatten norms, i.e. the bi-trace and tri-tracenorms, and prov...

متن کامل

A Perturbation Inequality for the Schatten-$p$ Quasi-Norm and Its Applications to Low-Rank Matrix Recovery

In this paper, we establish the following perturbation result concerning the singular values of a matrix: Let A,B ∈ R be given matrices, and let f : R+ → R+ be a concave function satisfying f(0) = 0. Then, we have min{m,n}

متن کامل

Supplementary Materials for “ Tractable and Scalable Schatten Quasi - Norm Approximations for Rank Minimization ”

In this supplementary material, we give the detailed proofs of some lemmas, properties and theorems, as well as some additional experimental results on synthetic data and four recommendation system data sets. A More Notations R n denotes the n-dimensional Euclidean space, and the set of all m×n matrices with real entries is denoted by R m×n. Given matrices X and Y ∈ R m×n , the inner product is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing

سال: 2015

ISSN: 0165-1684

DOI: 10.1016/j.sigpro.2015.02.025